Computational hardness assumptions - PDFSEARCH.IO - Document Search Engine

Computational hardness assumptions
Results: 76

#	Item
51	Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting Allison Lewko ∗ The University of Texas at Austin [removed] Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-01-18 02:15:43 Linear algebra Cryptography Group theory Computational hardness assumptions Transpose XTR Decision Linear assumption Inner product space ID-based encryption Algebra Mathematics Abstract algebra
52	Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants Allison B. Lewko ∗ University of Texas at Austin Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-10-16 13:57:22 Pseudorandomness Computational hardness assumptions Pseudorandom number generators Algorithmic information theory Pseudorandom generator Naor-Reingold Pseudorandom Function Decisional Diffie–Hellman assumption Pseudorandom function family Randomized algorithm Cryptography Theoretical computer science Applied mathematics
53	ECRYPT II   ICT[removed]ECRYPT II European Network of Excellence in Cryptology II Add to Reading List Source URL: www.ecrypt.eu.org Language: English - Date: 2010-05-04 11:48:24 Finite fields Cryptographic protocols Diffie–Hellman problem Hellman XTR CDH Diffie–Hellman key exchange Whitfield Diffie Discrete logarithm Cryptography Abstract algebra Computational hardness assumptions
54	ECRYPT II   ICT[removed]ECRYPT II European Network of Excellence in Cryptology II Add to Reading List Source URL: www.ecrypt.eu.org Language: English - Date: 2013-03-26 12:35:28 Finite fields Cryptographic protocols Diffie–Hellman problem Trapdoor function Hellman XTR CDH Diffie–Hellman key exchange Discrete logarithm Cryptography Abstract algebra Computational hardness assumptions
55	1 abelian group 266 absolute value 307 addition mod P 427 additive identity 293, 497 additive inverse 293 Add to Reading List Source URL: www.math.umn.edu Language: English - Date: 2005-08-31 12:46:44 Integer sequences Integer factorization algorithms Finite fields Modular arithmetic Computational hardness assumptions Prime number Quadratic residue RSA Quadratic sieve Mathematics Cryptography Abstract algebra
56	Curriculum Vitae Palash Sarkar Professor Applied Statistics Unit Indian Statistical Institute Add to Reading List Source URL: www.isical.ac.in Language: English - Date: 2014-04-16 02:49:00 Indocrypt Fast Software Encryption Indian Statistical Institute Cryptographic hash function IEEE Transactions on Information Theory National Security Agency Diffie–Hellman problem Cryptography Computational hardness assumptions Finite fields
57	Certicom ECC Challenge Abstract Certicom is pleased to present the Certicom Elliptic Curve Cryptosystem (ECC) Challenge. The first of its kind, the ECC Challenge has been developed to increase the industry’s understand Add to Reading List Source URL: www.certicom.com Language: English - Date: 2008-02-26 14:48:25 Finite fields Computational hardness assumptions Group theory Key management Elliptic curve cryptography Elliptic curve Integer factorization Key size Elliptic Curve DSA Abstract algebra Cryptography Mathematics
58	Victor Shoup Curriculum Vitae Feb. 6, 2014 Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer Street Add to Reading List Source URL: www.shoup.net Language: English - Date: 2014-02-06 21:21:47 Finite fields Cryptographic protocols Homomorphic encryption Diffie–Hellman problem Strong RSA assumption RSA Elliptic curve cryptography Actor model Eurocrypt Cryptography Public-key cryptography Computational hardness assumptions
59	2.3. Diffie–Hellman key exchange[removed] Add to Reading List Source URL: www.math.brown.edu Language: English - Date: 2008-03-20 11:43:17 Electronic commerce Finite fields Computational hardness assumptions Diffie–Hellman key exchange ElGamal encryption RSA Diffie–Hellman problem XTR CEILIDH Cryptography Public-key cryptography Cryptographic protocols
60	Counting in number theory Finite cyclic groups Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2010-09-16 10:24:31 Computational hardness assumptions Group theory Cryptographic protocols Modular arithmetic Discrete logarithm Cyclic group Diffie–Hellman problem Prime number Order Abstract algebra Algebra Finite fields

UPDATE